Optimal routing for dynamic ATFM

In this paper we study the problem of optimal routing in the global context of dynamic ATFM for the European Airspace. The modelling and the algorithms described below have been developed in order to feed with trajectories a global optimization problem in accordance with the column generation technique. However, the method can be used independently to quickly build feasible 4-dimensional trajectories that take into account not only costs of flight (fuel consumption, arrival time...) but also dynamic costs of using control resources. In the first part we describe the general context of dynamic ATFM, the method of column generation and the resulting constraints on the shortest path problem we try to solve. The modelling of the network and of the sectors is detailed in the second section and the algorithms used to build set of feasible trajectories are introduced in the third one. Finally the first experimental results conducted on a modelling of the whole European network with real data from the CFMU are given with the conclusion.